Proving program inclusion using Hoare's logic
نویسندگان
چکیده
منابع مشابه
Proving Program Termination in Higher Order Logic∗
We suggest two simple additions to packages that use wellfounded recursion to justify termination of recursive programs: The contraction condition, to be proved in cases when termination conditions are difficult or impossible to extract automatically; user-supplied inductive invariants in cases of nested recursion. We have implemented these additions in Isabelle/HOL and demonstrated their usefu...
متن کاملProving language inclusion and equivalence by coinduction
Language equivalence and inclusion can be checked coinductively by establishing a (bi)simulation on suitable deterministic automata. In this paper we present an enhancement of this technique called (bi)simulation-up-to. We give general conditions on language operations for which bisimulation-up-to is sound. These results are illustrated by a large number of examples, giving new proofs of classi...
متن کاملProving Inter-Program Properties
We develop foundations for proving properties relating two programs. Our formalization is based on a suitably adapted notion of program invariant for a single program. First, we give an abstract formulation of the theory of program invariants based on the notion of assertion function: a function that assigns assertions to program points. Then, we develop this abstract notion further so that it ...
متن کاملProving Properties of Actor Programs Using Temporal Logic
meth perform (message) if (ask tail isEmpty) then let value = (ask head (ask message getSelector) (ask message getParams)) in (send (ask message getReturnAddress) return (value)) else let newTag = create(Tag) in (let mess = ask message copywithTagReturnTo (newTag message) in (send tail perform (m); send (ask message getReturnaddress) returnWithReqiredReceipts(nil newTag))) ... endDef Figure 9: ...
متن کاملLogic Programming and Theorem Proving
This paper presents a new system, called the A-System, performing abductive reasoning within theframework of Abductive Logic Programming. It isbased on a hybrid computational model that imple-ments the abductive search in terms of two tightlycoupled processes: a reduction process of the high-level logical representation to a lower-level con-straint store and a lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1984
ISSN: 0304-3975
DOI: 10.1016/0304-3975(84)90065-3